On finite field arithmetic in characteristic 2

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Field Arithmetic

11.1 Prime fields of odd characteristic 201 Representations and reductions • Multiplication • Inversion and division • Exponentiation • Squares and square roots 11.2 Finite fields of characteristic 2 213 Representation • Multiplication • Squaring • Inversion and division • Exponentiation • Square roots and quadratic equations 11.3 Optimal extension fields 229 Introduction • Multiplication • Exp...

متن کامل

on finite arithmetic groups

let $f$ be a finite extension of $bbb q$‎, ‎${bbb q}_p$ or a global‎ ‎field of positive characteristic‎, ‎and let $e/f$ be a galois extension‎. ‎we study the realization fields of‎ ‎finite subgroups $g$ of $gl_n(e)$ stable under the natural‎ ‎operation of the galois group of $e/f$‎. ‎though for sufficiently large $n$ and a fixed‎ algebraic number field $f$ every its finite extension $e$ is‎ ‎re...

متن کامل

Complexity of finite field arithmetic

For integers, the parameter n is the bit-length, and for the finite field Fq we let n = log q. In the case of polynomial root-finding, d is the degree of the polynomial and we list bounds on the expected running time since these operations are most efficiently implemented using probabilistic algorithms. In Lecture 3 we addressed the cost of addition and subtraction in both Z and Fq, and the cos...

متن کامل

Efficient Arithmetic on Elliptic Curves in Characteristic 2

We present normal forms for elliptic curves over a field of characteristic 2 analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient algorithms for point addition and scalar multiplication on these forms. The resulting algorithms apply to any elliptic curve over a field of characteristic 2 with a ...

متن کامل

Efficient Arithmetic in Finite Fields of Small Odd Characteristic

In this thesis we present and analyse a generic representation for finite fields of small, odd, characteristic. The technique was originally developed at Ericsson Research, but was improved upon as a part of the thesis work. As the primary practical interest for this class of fields lies in elliptic curve cryptography, we also give an introduction to this subject along with considerations of pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2020

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2020.101739